/**
 * //编写一个函数，不用临时变量，直接交换numbers = [a, b]中a与b的值。
 * //
 * // 示例：
 * //
 * //
 * //输入: numbers = [1,2]
 * //输出: [2,1]
 * //
 * //
 * // 提示：
 * //
 * //
 * // numbers.length == 2
 * // -2147483647 <= numbers[i] <= 2147483647
 * //
 * //
 * // Related Topics 位运算 数学 👍 77 👎 0
 */

package com.xixi.basicAlgroithms.bitManipulation;

public class ID_interview_16_01_SwapNumbersLcci {
    public static void main(String[] args) {
        Solution solution = new ID_interview_16_01_SwapNumbersLcci().new Solution();
    }


    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int[] swapNumbers(int[] numbers) {

            numbers[0] ^= numbers[1]; //n0 == n0^n1;
            numbers[1] ^= numbers[0]; //n1 == n0;
            numbers[0] ^= numbers[1]; //n0 == n1;

            return numbers;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)


}